A 4-approximation algorithm for guarding 1.5-dimensional terrainsKING, James.Lecture notes in computer science. 2006, pp 629-640, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Efficient approximate dictionary look-up for long words over small alphabetsARSLAN, Abdullah N.Lecture notes in computer science. 2006, pp 118-129, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Exponential lower bounds on the space complexity of OBDD-Based graph algorithmsSAWITZKI, Daniel.Lecture notes in computer science. 2006, pp 781-792, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

RNA molecules : Glimpses through an algorithmic lensCONDON, Anne.Lecture notes in computer science. 2006, pp 8-10, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 3 p.Conference Paper

Modelling errors and recovery for communicationSUDAN, Madhu.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-32755-X, 1Vol, p. 25Conference Paper

A faster algorithm for finding maximum independent sets in sparse graphsFURER, Martin.Lecture notes in computer science. 2006, pp 491-501, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 11 p.Conference Paper

Matching based augmentations for approximating connectivity problemsRAVI, R.Lecture notes in computer science. 2006, pp 13-24, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Algorithmic challenges in web search enginesBAEZA-YATES, Ricardo.Lecture notes in computer science. 2006, pp 1-7, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 7 p.Conference Paper

C-varieties, actions and wreath productCHAUBARD, Laura.Lecture notes in computer science. 2006, pp 274-285, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

The branch-width of circular-arc graphsMAZOIT, Frédéric.Lecture notes in computer science. 2006, pp 727-736, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 10 p.Conference Paper

Electronic jury voting protocolsHEVIA, Alejandro; KIWI, Marcos.Lecture notes in computer science. 2002, pp 415-429, issn 0302-9743, isbn 3-540-43400-3Conference Paper

On-line approximate string matching with bounded errorsKIWI, Marcos; NAVARRO, Gonzalo; TELHA, Claudio et al.Theoretical computer science. 2011, Vol 412, Num 45, pp 6359-6370, issn 0304-3975, 12 p.Article

A concentration bound for the longest increasing subsequence of a randomly chosen involutionKIWI, Marcos.Discrete applied mathematics. 2006, Vol 154, Num 13, pp 1816-1823, issn 0166-218X, 8 p.Conference Paper

Gaussian Laws for the Main Parameters of the Euclid AlgorithmsLHOTE, Loïck; VALLEE, Brigitte.Algorithmica. 2008, Vol 50, Num 4, pp 497-554, issn 0178-4617, 58 p.Conference Paper

Expected length of the longest common subsequence for large alphabetsKIWI, Marcos; LOEBL, Martin; MATOUSEK, Jiri et al.Lecture notes in computer science. 2004, pp 302-311, issn 0302-9743, isbn 3-540-21258-2, 10 p.Conference Paper

Hardness amplification via space-efficient direct productsGURUSWAMI, Venkatesan; KABANETS, Valentine.Lecture notes in computer science. 2006, pp 556-568, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 13 p.Conference Paper

Lower bounds for geometric diameter problemsFOURNIER, Hervé; VIGNERON, Antoine.Lecture notes in computer science. 2006, pp 467-478, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Network flow spannersDRAGAN, Feodor F; CHENYU YAN.Lecture notes in computer science. 2006, pp 410-422, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 13 p.Conference Paper

Packing dicycle covers in planar graphs with no K₅ -e minorLEE, Orlando; WILLIAMS, Aaron.Lecture notes in computer science. 2006, pp 677-688, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Position-restricted substring searchingMAKINEN, Veli; NAVARRO, Gonzalo.Lecture notes in computer science. 2006, pp 703-714, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

An algorithm for a generalized maximum subsequence problemBERNHOLT, Thorsten; HOFMEISTER, Thomas.Lecture notes in computer science. 2006, pp 178-189, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Classical computability and fuzzy turing machinesRENE CALLEJAS BEDREGAL, Benjamin; FIGUEIRA, Santiago.Lecture notes in computer science. 2006, pp 154-165, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Minimal eulerian circuit in a labeled digraphMORENO, Eduardo; MATAMALA, Martin.Lecture notes in computer science. 2006, pp 737-744, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 8 p.Conference Paper

Minimal split completions of graphsHEGGERNES, Pinar; MANCINI, Federico.Lecture notes in computer science. 2006, pp 592-604, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 13 p.Conference Paper

On clusters in markov chainsAILON, Nir; CHIEN, Steve; DWORK, Cynthia et al.Lecture notes in computer science. 2006, pp 43-55, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 13 p.Conference Paper